package com.beimihu.leetcode;

public class MinPathSum {
    public static int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m][n];
        dp[0][0] = grid[0][0];

        for(int i = 0 ; i < m ;i++){
            for(int j = 0 ; j< n ;j++){
                if(i == 0 && j  == 0) continue;
                else if(i ==0) dp[i][j] = grid[i][j-1] + grid[i][j];
                else if (j==0) dp[i][j] = grid[i-1][j] + grid[i][j];
                else dp[i][j] = Math.min(grid[i-1][j]+ grid[i][j],grid[i][j-1] + grid[i][j]);
            }
        }
        return dp[m - 1][n - 1];
    }
    public static void main(String[] args) {
        // 定义一个二维数组
        int[][] twoDArray = {
                {1, 2, 3},
                {4, 5, 6},
                {7, 8, 9}
        };
        int m = minPathSum(twoDArray);
        System.out.println(m);
    }
}
